common refinement

См. также в других словарях:

• common — ► ADJECTIVE (commoner, commonest) 1) occurring, found, or done often; not rare. 2) without special qualities, rank, or position; ordinary. 3) of the most familiar type. 4) showing a lack of taste and refinement supposedly typical of the lower… …   English terms dictionary

• Common rail — HDi redirects here. For the interactive format, see HDi (interactivity). DCi redirects here. For other uses, see DCI (disambiguation). CRDi redirects here. For other uses, see CRDi (disambiguation). Common rail direct fuel injection is a modern… …   Wikipedia

• common — I. adjective Etymology: Middle English commun, from Anglo French, from Latin communis more at mean Date: 13th century 1. a. of or relating to a community at large ; public < work for the common good > b. known to the community …   New Collegiate Dictionary

• common — adjective (commoner, commonest) 1》 occurring, found, or done often; not rare.     ↘without special rank or position; ordinary.     ↘(of a quality) of a sort to be generally expected: common decency.     ↘of the most familiar type. 2》 shared by… …   English new terms dictionary

• Stars of the Lid and Their Refinement of the Decline — Infobox Album | Name = Stars of the Lid and Their Refinement of the Decline Type = Album Artist = Stars of the Lid Released = April 7, 2007 Recorded = Genre = Ambient, Drone Length = 120:32 Label = Kranky Producer = Reviews = * Allmusic… …   Wikipedia

• Rietveld refinement — is a technique devised by Hugo Rietveld for use in the characterisation of crystalline materials. The neutron and x ray diffraction of powder samples results in a pattern characterised by peaks in intensity at certain positions. The height, width …   Wikipedia

• Tarjan's off-line least common ancestors algorithm — In computer science, Tarjan s off line least common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union find data structure. The least common ancestor of two nodes d and e in… …   Wikipedia

• Minkowski Portal Refinement — Screenshot from XenoCollide, the first implementation of MPR. The Minkowski Portal Refinement collision detection algorithm is a technique for determining whether two convex shapes overlap. The algorithm was created by Gary Snethen in 2006 and… …   Wikipedia

• Partition of an interval — In mathematics, a partition, P of an interval [a, b] on the real line is a finite sequence of the form a = x0 < x1 < x2 < ... < xn = b. Such partitions are used in the theory of the Riemann integral, the Riemann–Stieltjes integral and …   Wikipedia

• DFA minimization — In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states. Here, two DFAs are called …   Wikipedia

• Associated bundle — In mathematics, the theory of fiber bundles with a structure group G (a topological group) allows an operation of creating an associated bundle, in which the typical fiber of a bundle changes from F 1 to F 2, which are both topological spaces… …   Wikipedia